She scraped together the dead leaves till she had formed them into a large heap, making a sort of nest in the middle. 她把一些枯叶扫到一起,堆成一大堆,在中间扒出一个窝来。
Due to the high sort overflow ratio, you need to increase the sort heap ( SORTHEAP), and/ or the sort heap threshold ( SHEAPTHRES). 由于这个较高的排序溢出率,您需要增加排序堆(SORTHEAP)和/或排序堆阈值(SHEAPTHRES)。
The sort heap is a memory pool that belongs to the agent private memory set. sortheap是属于代理私有内存集的一个内存池。
If the sorted data cannot fit entirely into the sort heap, which is a block of memory that is allocated each time a sort is performed, it overflows into a temporary table owned by the database. 如果无法将排序的数据整个放入排序堆中(排序堆是每次执行排序时分配的一块内存),它就会溢出到该数据库所有的临时表中。
If a shared sort is performed, the sort heap for the sort is allocated in database shared memory. 如果执行共享排序,那么就会在数据库共享内存中分配用于这种排序的排序堆。
It works the same way for sort heap, as we'll see in the sort heap section below. 正如将在下面的排序堆一节中所看到的,它的工作方式与排序堆的相同。
If the value of Piped sorts ratio is low, you should consider increasing the sort heap threshold ( sheapthres) for better sort performance. 如果管道排序率的值很低,您就应该考虑增加排序堆阈值(sheapthres)以获得更高的排序性能。
FPGA Realization of Heap Sort in QoS Guarantee Mechanism QoS保障机制中的FPGA堆排序实现
Directly into the sort simple selection sort bubble sort quick sort heap sort. 简单选择排序;冒泡排序;快速排序;堆排序。
This paper offers a queue scheduling algorithm of the PQ+ CBWFQ in router based on heap sort, algorithm realization and hardware plan of low-cost. It is of important significance to design high-performance router in future. 文章提出基于堆排序的PQ+CBWFQ网络路由器排队调度算法进行具体实现,并给出低成本的硬件实现方案,对未来的高性能路由器设计具有重要的参考价值。
The application and analysis of heap sort 堆排序应用及分析
Heap sort is an effective sorting algorithm and can operate "in place", as it re-quires smallest additional storage. 堆排序是一个高效的排序算法,其特点是辅助空间小,可以就地排序。
To speed up computation, we use Quick Sort algorithm and Insertion Sort algorithm instead of usually used Heap Sort algorithm. 在最小走时节点查寻中,结合使用快速排序算法与插入排序算法,替代以往方法中多采用的堆排序算法;
Queue Scheduling Algorithm of the PQ+ CBWFQ in Router Based on Heap Sort 基于堆排序的PQ+CBWFQ路由器排队调度算法
For the network architecture, the dissertation provides a conception of "heap network", in which the super node is selected by Heap sort and administer upon nodes. Then, these super nodes form themselves into a larger B-tree network. 在网络结构设计中,又创新性的提出了堆网络概念,堆网络中以堆排序的方式产生最优的超结点来管理普通结点,超结点又组成更大的B-树网络。
Fast Fourier Transform ( FFT) and Heap Sort algorithm FFT algorithm are very common, they are widely applied in signal transmission range and scientific calculation. 快速傅里叶变换(FFT)和堆排序算法都是常见的算法,它们在信号传输和科学计算等方面都有着广泛的应用。